On optimal solutions to the firing squad synchronization problem
نویسندگان
چکیده
منابع مشابه
On Optimal Solutions to the Firing Squad Synchronization Problem
The one-dimensional firing squad synchronization problem (FSSP) is to construct a generic automaton of a one dimensional cellular network made of a segment of n identical machines so that, whatever the length n of the segment is, 1. if, at the starting time (t = 1 in the following), all finite automata of the cellular network (called cells) are in a quiescent state L and no meaningful piece of ...
متن کاملAbout 4-States Solutions to the Firing Squad Synchronization Problem
We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.
متن کاملVarious Solutions to the Firing Squad Synchronization Problems
We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes are finite state processors that work at unison discrete steps. The networks considered are the line, the ring and the square. For all of these models we have considered one and two-way communication modes and also constrained the quantity of information that adjacent...
متن کاملOn Formulations of Firing Squad Synchronization Problems
We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield different minimum firing times for some variations of the problem. Our results suggest that the new formulat...
متن کاملFiring Squad Synchronization Problem in Reversible Cellular Automata
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA). First we proved that, in the case of RCA, there is no solution under the usual condition for FSSP where the firing state is only one. So we defined a little weaker condition suitable for RCA in which finite number of firing states are allowed. We showed that Minsky’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00084-9